Arc- and circle-visibility graphs
نویسنده
چکیده
We study polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the well-studied bar-visibility graphs and are characterized here, when arcs are proper subsets of circles, as the graphs that embed on the plane with all but at most one cut-vertex on a common face or on the projective plane with all cut-vertices on a common face. We also characterize the graphs representable using full circles and arcs.
منابع مشابه
On Visibility Graphs — Upper Bounds and Classification of Special Types
We examine several types of visibility graphs: bar and semi-bar k-visibility graphs, rectangle k-visibility graphs, arc and circle k-visibility graphs, and compact visibility graphs. We improve the upper bound on the thickness of bar k-visibility graphs from 2k(9k − 1) to 6k, and prove that the upper bound must be at least k + 1. We also show that the upper bound on the thickness of semi-bar k-...
متن کاملOn k-visibility graphs
We examine several types of visibility graphs in which sightlines can pass through k objects. For k ≥ 1 we bound the maximum thickness of semi-bar k-visibility graphs between d 2 3 (k + 1)e and 2k. In addition we show that the maximum number of edges in arc and circle k-visibility graphs on n vertices is at most (k+1)(3n− k− 2) for n > 4k+4 and ( n 2 ) for n ≤ 4k + 4, while the maximum chromati...
متن کاملFurther results on arc and bar k-visibility graphs
We consider visibility graphs involving bars and arcs in which lines of sight can pass through at most k objects. We prove a new edge bound for arc k-visibility graphs, provide maximal constructions for arc visibility graphs and semi-arc k-visibility graphs, and give a complete characterization of semi-arc visibility graphs. We further show that the family of arc i-visibility graphs is never co...
متن کاملThe intersection between some subclasses of circular-arc and circle graphs
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. The intersection graph of a family of chords in a circle is called a circle graph. Analogously, this class of graphs admits some subcla...
متن کاملStructural results on circular-arc graphs and circle graphs: A survey and the main open problems
Circular-arc graphs are the intersection graphs of open arcs on a circle. Circle graphs are the intersection graphs of chords on a circle. These graph classes have been the subject of much study for many years and numerous interesting results have been reported. Many subclasses of both circular-arc graphs and circle graphs have been defined and different characterizations formulated. In this su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 25 شماره
صفحات -
تاریخ انتشار 2002